Optimal binary communication with nonequal probabilities

نویسندگان

  • Israel Korn
  • John P. Fonseka
  • Shaohui Xing
چکیده

Optimal signal energies are derived for optimal binary digital communication systems with arbitrary signal probabilities and correlation with both coherent and noncoherent detection. The resulting bit-error probability (BEP) is computed and compared with the BEP of the same systems with equal signal energies. One of the conclusions is that for the coherent system with nonegative correlation, and for noncoherent system with arbitrary correlation, the optimal signals are on-off keying (OOK), i.e., the signal with probability 0 5 has energy , while the second signal has zero energy where is the average signal energy. The proposed system is also better than a system with source coding and equiprobable signals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncoded optimal binary communication for sources withmemory using the BurrowsWheeler Transform

Given an AWGN channel, we look at the problem of designing an optimal binary uncoded communication system for transmitting blocks of binary symbols generated by a stationary source with memory modelled by a Markov chain (MC) or a hidden Markov model (HMM). The goal is to minimize the average SNR required for a given block error rate. The particular case where the binary source is memoryless wit...

متن کامل

A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks

In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...

متن کامل

New Ways to Construct Binary Search Trees

We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search tree given the rank by probability of each possible outcome, and height-restricting an optimal binary search tree when the increase in cost is restricted. Whereas most algorithms for constructing good binary search trees need t...

متن کامل

Optimal Binary Search Trees with Near Minimal Height

Suppose we have n keys, n access probabilities for the keys, and n+1 access probabilities for the gaps between the keys. Let hmin(n) be the minimal height of a binary search tree for n keys. We consider the problem to construct an optimal binary search tree with near minimal height, i.e. with height h ≤ hmin(n) +∆ for some fixed ∆. It is shown, that for any fixed∆ optimal binary search trees wi...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Channel Detection in Coded Communication

We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the prevailing channel. We begin with the simplified case where each of the sets is a singleton. For any given code, we derive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2003